منابع مشابه
On the Rectangle Escape Problem
Motivated by a bus routing application, we study the following rectangle escape problem: Given a set S of n rectangles inside a rectangular region R, extend each rectangle in S toward one of the four borders of R so that the maximum density over the region R is minimized, where the density of each point p ∈ R is defined as the number of extended rectangles containing p. We show that the problem...
متن کاملOn the d-Runaway Rectangle Escape Problem
In the Rectangle Escape problem, we are given a set of rectangles S in a rectangular region R, and we would like to extend these rectangles to one of the four sides of R while ensuring that the maximum number of overlaps is minimized. More formally, define the density of a point p in R as the number of extended rectangles that contain p. The question is then to find an extension with the smalle...
متن کاملOn the inclusion problem∗
Every directed acyclic graph (DAG) over a finite non-empty set of variables (= nodes) N induces an independence model overN , which is a list of conditional independence statements over N . The inclusion problem is how to characterize (in graphical terms) whether all independence statements in the model induced by a DAG K are in the model induced by a second DAG L. Meek [8] conjectured that thi...
متن کاملOn the maximum empty rectangle problem
Given a rectangle A and a set S of n points in A, we consider the problem, called the maximum empty rectangle problem, of finding a maximum area rectangle that is fully contained in A and does not contain any point of S in its interior. An O(n’) time algorithm is presented. Furthermore, it is shown that if the points of S are drawn randomly and independently from A, the problem can be solved in...
متن کاملRectangle Transformation Problem
In this paper, we propose the rectangle transformation problem (RTP) and its variants. RTP asks for a transformation by a rectangle partition between two rectangles of the same area. We are interested in the minimum RTP which requires to minimize the partition size. We mainly focus on the strict rectangle transformation problem (SRTP) in which rotation is not allowed in transforming. We show th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1995
ISSN: 0002-9939
DOI: 10.2307/2160681